A Tabulation Proof Procedure for Residuated Logic Programming
نویسندگان
چکیده
Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. In this work we provide a tabulation goal-oriented query procedure, and show that our tabulation query procedure terminates if and only if the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely-many steps. On the basis of this result we show that the tabulation procedure terminates for important classes of residuated logic programs, in particular for probabilistic deductive databases of Lakshmanan and Sadri.
منابع مشابه
A tabulation procedure for first-order residuated logic programs
Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertainty. Regarding automated deduction, a tabulation procedure was recently introduced for the propositional version. In this paper, we introduce a sound and complete tabulation-based proof procedure for the first-order extension of residuated logic programs.
متن کاملTermination of logic programs with imperfect information: applications and query procedure
A general logic programming framework allowing for the combination of several adjoint lattices of truth-values is presented. The language is sorted, enabling the combination of several reasoning forms in the same knowledge base. The contribution of the paper is two-fold: on the one hand, sufficient conditions guaranteeing termination of all queries for the fix-point semantics for a wide class o...
متن کاملFinite embeddability property for residuated groupoids
A very simple proof of the finite embeddability property for residuated distributivelattice-ordered groupoids and some related classes of algebras is presented. In particular, this gives an answer to the question posed in [3, Problem 4.2]. The presented construction allows for improvement of the upper bound on the complexity of the decision procedure for the universal theory of residuated distr...
متن کاملThe Variety of Residuated Lattices is Generated by its Finite Simple Members
In this paper, we will show that the variety of residuated lattices is generated by finite simple residuated lattices. The “simplicity” part of the proof is based on Grǐsin’s idea from [5], whereas the “finiteness” part employs a kind of algebraic filtration argument. Since the set of formulas valid in all residuated lattices is equal to the set of formulas provable in the propositional logic F...
متن کاملTabulation of Functions in Definite Clause Programs
An extended version of the applicative caching technique from functional programming is adapted to OLD resolution as an alternative to OLDT resolution for predicates that are actually functions. An inference system, OLDTF resolution, is given with a proof procedure. It is argued why this special case is interesting in its own right also outside the area of deductive databases. It is outlined ho...
متن کامل